Finite groups whose intersection power graphs are toroidal and projective-planar
نویسندگان
چکیده
Abstract The intersection power graph of a finite group G G is the whose vertex set , and two distinct vertices x x y y are adjacent if either one identity element or ⟨ ⟩ ∩ \langle x\rangle \cap y\rangle non-trivial. In this paper, we completely classify all groups graphs toroidal projective-planar.
منابع مشابه
Classification of finite groups with toroidal or projective-planar permutability graphs
Let G be a group. The permutability graph of subgroups of G, denoted by Γ(G), is a graph having all the proper subgroups of G as its vertices, and two subgroups are adjacent in Γ(G) if and only if they permute. In this paper, we classify the finite groups whose permutability graphs are toroidal or projective-planar. In addition, we classify the finite groups whose permutability graph does not c...
متن کاملFinite groups all of whose proper centralizers are cyclic
A finite group $G$ is called a $CC$-group ($Gin CC$) if the centralizer of each noncentral element of $G$ is cyclic. In this article we determine all finite $CC$-groups.
متن کاملfinite groups whose minimal subgroups are weakly h*-subgroups
let $g$ be a finite group. a subgroup $h$ of $g$ is called an $mathcal h $ -subgroup in $g$ if $n_g (h)cap h^gleq h$ for all $gin g$. a subgroup $h$ of $g$ is called a weakly $mathcal h^ast $-subgroup in $g$ if there exists a subgroup $k$ of $g$ such that $g=hk$ and $hcap k$ is an $mathcal h$-subgroup in $g$. we investigate the structure of the finite group $g$ under the assump...
متن کاملClassification of finite simple groups whose Sylow 3-subgroups are of order 9
In this paper, without using the classification of finite simple groups, we determine the structure of finite simple groups whose Sylow 3-subgroups are of the order 9. More precisely, we classify finite simple groups whose Sylow 3-subgroups are elementary abelian of order 9.
متن کامل4-Connected Projective-Planar Graphs Are Hamiltonian
We prove the result stated in the title (conjectured by Grünbaum), and a conjecture of Plummer that every graph which can be obtained from a 4–connected planar graph by deleting two vertices is Hamiltonian. The proofs are constructive and give rise to polynomial–time algorithms.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Open Mathematics
سال: 2021
ISSN: ['2391-5455']
DOI: https://doi.org/10.1515/math-2021-0071